ork for S s to Circuit CI

Vertex orderings have been successfully applied to problems in netlist clustering and for system partitioning and layout [2] , [20]. We present a vertex ordering construction that encompasses most reasonable graph traversals. Two parameters-an attraction function and a window-provide the means for achieving various graph traversals and addressing particular clustering requirements. We then use dynamic programming [2] to optimally split the vertex ordering into a multiway clustering. Our approach outperforms several clustering methods in the literature in terms of three distinct clustering objectives [5], [8], [22]. The ordering construction, by itself, also outperforms existing graph ordering constructions [2] , [13], [17], [19], for this application. Tuning our approach to “meta-objectives,” particularly clustering for two-phase Fiduccia-Mattheyses bipartitioning [9], remains an open area of research.